Full Direction Local Neighbors Pattern (FDLNP)
نویسندگان
چکیده
منابع مشابه
Retinal Mosaics: Pattern Formation Driven by Local Interactions between Homotypic Neighbors
Individual types of retinal neurons are distributed across the retina as regular arrays of cells, commonly referred to as “retinal mosaics” (Wässle and Riemann, 1978). This regularity in their patterning is generally assumed to ensure that all locations across the retina are sub-served by every type of retinal neuron, each participating in their own unique way to the local computations carried ...
متن کاملWhen cells tell their neighbors which direction to divide.
Many cells must divide in specific orientations, yet for only a handful of cases do we have some understanding of how cells choose division orientations. We know of only a few cases where division orientations are controlled by specific cell-cell interactions. These cases are of interest, because they tell us something new and seemingly fundamental about how cells can function during developmen...
متن کاملk*-Nearest Neighbors: From Global to Local
The weighted k-nearest neighbors algorithm is one of the most fundamental nonparametric methods in pattern recognition and machine learning. The question of setting the optimal number of neighbors as well as the optimal weights has received much attention throughout the years, nevertheless this problem seems to have remained unsettled. In this paper we offer a simple approach to locally weighte...
متن کاملLocal Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کاملProbabilistic Polynomials and Hamming Nearest Neighbors (Full Version)
We show how to compute any symmetric Boolean function on n variables over any field (as well as the integers) with a probabilistic polynomial of degree O( √ n log(1/ε)) and error at most ε . The degree dependence on n and ε is optimal, matching a lower bound of Razborov (1987) and Smolensky (1987) for the MAJORITY function. The proof is constructive: a low-degree polynomial can be efficiently s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2021
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2021.0120116